Surprising results on task assignment in server farms with high-variability workloads
نویسندگان
چکیده
منابع مشابه
Task assignment in multiple server farms using preemptive migration and flow control
Existing task assignment policies proposed for assigning tasks in stand-alone server farms are not efficient in multiple server farm environments because they have not been designed to exploit the properties of such environments.With the emergence of high speed networks and operating systems that have features such as preemptive migration, the importance of designing task assignment policies fo...
متن کاملOn Choosing a Task Assignment Policy for aDistributed Server
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve order and the task's service demand is known in advance. We consider four task assignment policies commonly proposed for such distributed server systems: Round-Robin, Random, Size-Based, in which all tasks within a give ...
متن کاملServer farms with setup costs
In this paper we consider server farms with a setup cost. This model is common in manufacturing systems and data centers, where there is a cost to turn servers on. Setup costs always take the form of a time delay, and sometimes there is additionally a power penalty, as in the case of data centers. Any server can be either on, off, or in setup mode. While prior work has analyzed single servers w...
متن کاملTask assignment policies in distributed server systems: A survey
Data intensive computing, in the Web environment, motivates the distributed designs of Web server systems (Web clusters) because of their scalability and cost-effectiveness instead of one Web server with high performance. The task assignment policy, in such systems, focuses on the manner of assigning the tasks that reach these systems (e.g. the case of intensive requests that reach the distribu...
متن کاملSupplementary Material to “ Dynamic Server Assignment with Task - Dependent Server Synergy ”
Let π be a nonidling fully collaborative policy. Under any fully collaborative policy, our model is equivalent to one where the service requirements of successive customers at station j ∈ {1, . . . , N} are independent and identically distributed (i.i.d.) with mean 1 αjγj , service rates of collaborating servers are additive, and the service rates depend only on servers, i.e., μij = μi for all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review
سال: 2009
ISSN: 0163-5999
DOI: 10.1145/2492101.1555383